Dependency Centrality from Bipartite Social Networks
نویسنده
چکیده
This paper introduces dependency centrality, a node-level measure of structural leadership in bipartite networks. The measure builds on Zhou et al.’s (2007) flow-based method to transform bipartite data and captures additional information from the second mode that existing measures of centrality typically exclude. Three previously published bipartite networks serve as test cases to demonstrate the extent of correlation among node-level centrality rankings derived from dependency centrality and those derived from canonical centrality measures: degree, closeness, betweenness, and eigenvector. Ultimately, dependency centrality appears to offer a novel means to measure importance in bipartite networks depicting social interactions. Author Luke M. Gerdes is an Assistant Professor in the Department of Behavioral Sciences & Leadership at the United States Military Academy in West Point, New York. Notes This work was supported by the Office of the Secretary of Defense, Minerva Initiative. The views expressed herein are those of the author and do not purport to represent the official policy or position of the United States Military Academy, the Department of the Army, the Department of Defense, or the United States Government. Please send all correspondence to Luke M. Gerdes, Department of Behavioral Sciences & Leadership, United States Military Academy. Email: [email protected]
منابع مشابه
The Influence of Location on Nodes’ Centrality in Location-Based Social Networks
Nowadays, due to the widespread use of social networks, they can be used as a convenient, low-cost, and affordable tool for disseminating all kinds of information and data among the massive users of these networks. Issues such as marketing for new products, informing the public in critical situations, and disseminating medical and technological innovations are topics that have been considered b...
متن کاملTrend Prediction in Temporal bipartite Networks: the Case of MovieLens, Netflix, and Digg
Online systems where users purchase or collect items of some kind can be effectively represented by temporal bipartite networks where both nodes and links are added with time. We use this representation to predict which items might become popular in the near future. Various prediction methods are evaluated on three distinct datasets originating from popular online services (Movielens, Netflix, ...
متن کاملSolving Application Oriented Graph Theoretical Problems with DNA Computing
Important features of networks, e.g., length of shortest paths, centrality, are defined in a graph theoretical way. Bipartite graphs are frequently applied, not only in computer science (e.g. PetriNets), but in other sciences as well. They are used to represent various problems, for example, in medicine or in economy. The relations between customers and products can be represented by bipartite ...
متن کاملThe Prediction Dependency on Virtual Social Networks Based on Alexithymia, Attachment Styles, Well-Being Psychological and Loneliness
Introduction: Virtual social networks like others type of addiction can be affected by psychological, developmental, and emotional problems. So, the aim of this research is to The purpose of this study was to investigate prediction dependency on virtual social networks based on alexithymia, attachment styles, well-being psychological and loneliness. The research design was a two-group diagnosti...
متن کاملSocial Insurance Networks
Social Insurance Networks Based on administrative panel data from Norway, we examine how social insurance dependency spreads within neighborhoods, families, ethnic minorities, and among former schoolmates. We use a fixed effects methodology that accounts for endogenous group formation, contextual interactions, and time-constant as well as time-varying confounders. We report evidence that social...
متن کامل